package com.summer.LanQiao;

import java.math.BigInteger;
import java.util.*;

public class MoniSai {
    public static void A(){
        BigInteger bigInteger = new BigInteger("2023");
        BigInteger a = new BigInteger("1");
        while (true){
            System.out.println(bigInteger);
            String s = bigInteger.toString(2);
            String res = "000000";
            if (s.contains(res)) {
                System.out.println(s+"-----------"+bigInteger);
                break;
            }else {
                System.out.println(s);
                bigInteger=bigInteger.add(a);
            }
        }
    }
    public static void B(){
        //判断是否为润年
        int count = 92;
        int year = 1950;
        for (int i = year; i < 2022 ; i++) {
            if (i%4==0&&i%100!=0||i%400==0){
                    count+=366;
            }else count+=365;
        }
        System.out.println(count);
    }
    public static void C(){
     int a = 10;
     while (true){
        int res = Integer.parseInt(a+"",16);
        if (res%a==0)break;
        else a++;
    }
        System.out.println(a);
    }
    public static void D(){
        char[][] arr=new char[30][60];
        Scanner sc = new Scanner(System.in);
        for (int j = 0; j < 30; j++) {
         arr[j] = sc.nextLine().toCharArray();
        }
        for (int i = 0; i < 30; i++) {
            System.out.println(Arrays.toString(arr[i]));
        }
        System.out.println();
        int[][] res = new int[31][61];
        //三角形dp求最大和
        for (int i = 1; i < 31 ; i++) {
            for (int j = 1; j < 61; j++) {
                if ((i-1)>=0 &&(j-1)>=0)res[i][j] = (res[i-1][j]>res[i][j-1]?res[i-1][j]:res[i][j-1])+(arr[i-1][j-1]-'0');
            }
        }
        for (int i = 0; i < 31; i++) {
            System.out.println(Arrays.toString(res[i]));
        }
        System.out.println(res[30][60]);
    }
    public static void E(){
        int count = 16;
        int num = 10;
        boolean isZS = true;
        for (int i = 11; i <2022 ; i++) {
            if (count>=2022)break;
            for (int j = i-1; j >1 ; j--) {
                if (i%j==0){
                    isZS = false;
                    break;
                }
            }
            if (isZS) {
                System.out.println(i+"--素数");
                count += i;
                num++;
                System.out.println(count+"---"+num);//143
            }else isZS=true;
        }
        System.out.println(count+"---"+num);
    }
    public static void F(){
        Scanner sc = new Scanner(System.in);
       float t = sc.nextFloat();
       float c = sc.nextFloat();
       float s = sc.nextFloat();
        float rest = s-c;
        float sudu = c/t;
        float res = rest/sudu;
        long ress = (long) res;
        System.out.print(ress);//

    }
    public static void G(){
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        HashSet<String> set = new LinkedHashSet<>();
        String stemp = "";
        for (int i = 0; i < n ; i++) {
            stemp = sc.next();
            if (!set.contains(stemp)) set.add(stemp);
        }
        Iterator<String> iterator = set.iterator();
        while (iterator.hasNext()){
            System.out.println(iterator.next());
        }
        //set.forEach(e -> System.out.println(e));

    }
    public static void  H(){
        Scanner sc = new Scanner(System.in);
        String orign = sc.nextLine();
        StringBuilder builder = new StringBuilder(orign);
        int index = -1;
        if (builder.reverse().equals(orign)) System.out.println(orign);
        else {
            for (int i = 0,j=orign.length()-1; i <j&&j>=0 ;i++) {
                    if (orign.charAt(i)==orign.charAt(j)){
                       int k = i+1;
                       int g = j-1;
                       boolean flag = true;
                       while (k<g&&g>=0){
                           if (orign.charAt(k)!=orign.charAt(g)){
                               flag = false;
                               break;
                           }
                           k++;
                           g--;
                       }
                       if (flag) {
                           index = i;
                           break;
                       }
                    }
            }
            if (index==-1) System.out.println(new StringBuilder(orign).substring(0,orign.length()-1)+builder);
            else if (index==0) System.out.println(orign);
            else {
               StringBuilder builder1 = new StringBuilder(orign);
                System.out.println(orign+new StringBuilder(builder1.substring(0,index)).reverse());
            }
        }
    }
    public static void main(String[] args) {
        //A(); 2048
       B(); //26390
        //C(); 1038
        //D(); 592
        //E(); fail
        //F();OK
        //G();OK
        //H();OK
    }
}
